Partial Order Reduction in Directed Model Checking
نویسندگان
چکیده
Partial order reduction is a very succesful technique for avoid ing the state explosion problem that is inherent to explicit state model checking of asynchronous concurrent systems It exploits the commu tativity of concurrently executed transitions in interleaved system runs in order to reduce the size of the explored state space Directed model checking on the other hand addresses the state explosion problem by using guided search techniques during state space exploration As a con sequence shorter errors trails are found and less search e ort is required than when using standard depth rst or breadth rst search We analyze how to combine directed model checking with partial order reduction methods and give experimental results on how the combination of both techniques performs
منابع مشابه
On Partial-Order Reduction and Trail Improvement in Directed Model Checking
In this paper we address the problem of reconciling trail improvement, partial order reduction and directed explicit state model checking. While directed model checking addresses the problem of finding optimally short counterexamples, trail improvement seeks to find shorter trails to some given error state. Both directed model checking and trail improvement employ heuristic, guided search techn...
متن کاملFrom Distributed Memory Cycle Detection to Parallel LTL Model Checking
In [2] we proposed a parallel graph algorithm for detecting cycles in very large directed graphs distributed over a network of workstations. The algorithm employs back-level edges as computed by the breadth first search. In this paper we describe how to turn the algorithm into an explicit state distributed memory LTL model checker by extending it with detection of accepting cycles, counterexamp...
متن کاملSurvey on Directed Model Checking
This article surveys and gives historical accounts to the algorithmic essentials of directed model checking, a promising bug-hunting technique to mitigate the state explosion problem. In the enumeration process, successor selection is prioritized. We discuss existing guidance and methods to automatically generate them by exploiting system abstractions. We extend the algorithms to feature partia...
متن کاملCombining Partial
Partial order based reduction techniques to reduce time and memory in model-checking procedures are becoming quite popular. Partial order reduction techniques exploit the independence of actions. Symmetry based reduction techniques exploit the inherent structure of the system to reduce the state space explored during model checking. We provide an abstract framework for combining partial-order a...
متن کاملPartial - Order Reduction in theWeak Modal Mu -
We present a partial-order reduction technique for local model checking of hierarchical networks of labeled transition systems in the weak modal mu-calculus. We have implemented our technique in the Concur-rency Factory speciication and veriication environment; experimental results show that partial-order reduction can be highly eeective in combating state explosion in modal mu-calculus model c...
متن کامل